Isomorphic Allocation in k-ary n-cube Systems
نویسندگان
چکیده
Due to its topological generality and exibility, the k-ary n-cube architecture is actively researched exploring network design tradeoos as well as characterizing the topology. Processor allocation problem, which has been extensively attempted for hypercubes and meshes, however, has not been addressed for the k-ary n-cube parallel computers. 22]]23] are the only reported works but their schemes are based on the hypercube algorithms. They divide a cube into a number of low dimensional subcube \slices" but having the same size in each dimension. One disadvantage inherent to the conventional Slice Partitioning is the enormous amount of internal fragmentation of processors due to the job size limitation. In addition, the low dimensional partitions do not inherit the merits of the original higher order architecture. In this paper, we propose Isomorphic Partitioning, where a partitioned subcube retians the high order of dimension of the whole system but with smaller size in each dimension. The partitioned subcubes maintain the advantages of the high order architecture. Extensive simulation comparing the Isomorphic Strategy based on the Isomorphic Partitioning with the conventional allocation algorithms show that the eeectiveness of the proposed scheme.
منابع مشابه
Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems
Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partiti...
متن کاملA Fast and Efficient Isomorphic Task Allocation Scheme for K-Ary N-Cube Systems
A good task allocation algorithm should find available processors for incoming jobs, if they exist, with minimum overhead. Due to its topological generality and flexibility the k-ary n-cube architecture has been chosen for the task allocation problem. We propose a fast and efficient isomorphic processor allocation scheme for k-ary n-cube systems by using isomorphic partitioning where the proces...
متن کاملContiguous and Non - Contiguous Processorallocation Algorithms for K - Ary N - Cubes
EEcient utilization of processing resources in a large, multiuser parallel computer depends on processor allocation algorithms that minimize system fragmentation. We propose three processor allocation algorithms for the k-ary n-cube class of parallel architectures, which includes the hypercube and multidi-mensional torus. The k-ary Partner strategy is a conventional contiguous processor allocat...
متن کاملA Real - Time Fault - Tolerant k - ary n - cube Multiprocessor
We present a real-time fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. The k-ary n-cube is augmented by spare nodes at stages one and two. We consider two modes of operations, one under heavy computation or hard deadline and the other under light computation or soft deadline. We assume that faulty nodes cannot compute, but retain their ability to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999